On Minimax Fractional Programming of Generalized Convex Set Functions
نویسندگان
چکیده
منابع مشابه
Duality in nondifferentiable minimax fractional programming with generalized convexity
A Mond–Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F,a,q,d)-pseudoconvex functions. 2005 Elsevier Inc. All rights reserved.
متن کاملMinimax Fractional Programming Involving Type I and Related Functions
⎯The convexity assumptions for a minimax fractional programming problem of variational type are relaxed to those of a type I and related functions. Sufficient optimality conditions are established under the aforesaid assumptions. Several duality theorems are obtained for Wolfe type and Mond-Weir type duals and the original problem. Keyword⎯Minimax programming; Fractional programming; Sufficient...
متن کاملProperties of Answer Set Programming with Convex Generalized Atoms
In recent years, Answer Set Programming (ASP), logic programming under the stable model or answer set semantics, has seen several extensions by generalizing the notion of an atom in these programs: be it aggregate atoms, HEX atoms, generalized quantifiers, or abstract constraints, the idea is to have more complicated satisfaction patterns in the lattice of Herbrand interpretations than traditio...
متن کاملFractional programming with convex quadratic forms and functions
This article is concerned with two global optimization problems (P1) and (P2). Each of these problems is a fractional programming problem involving the maximization of a ratio of a convex function to a convex function, where at least one of the convex functions is a quadratic form. First, the article presents and validates a number of theoretical properties of these problems. Included among the...
متن کاملMULTIOBJECTIVE NONLINEAR FRACTIONAL PROGRAMMING PROBLEMS INVOLVING GENERALIZED d - TYPE - I n - SET FUNCTIONS
For 1 1 ( ) ( )∈! m m m x = x ,...,x , y = y ,...,y we put ≤ x y iff i i x y ≤ for each { } 1 2 ∈ i M = , ,...,m ; ≤ x y iff ≤ i i x y for each i M ∈ , with x y; x < y ≠ iff i i x < y for each i M ∈ . We write + ∈! m x iff 0 ≥ x . For an arbitrary vector n x∈! and a subset J of the index set { } 1 2 n , ,..., , we denote by J x the vector with components j x , j J ∈ . Let ( ) μ X , Γ, be a fini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2000
ISSN: 0022-247X
DOI: 10.1006/jmaa.2000.6715